Weak and Strong Reinforcement Number For a Graph
نویسندگان
چکیده
Let G=(V(G),E(G)) be a graph.A set of vertices S in a graph G is called to be a Smarandachely dominating k-set, if each vertex of G is dominated by at least k vertices of S. Particularly, if k = 1, such a set is called a dominating set of G. The Smarandachely domination k -number γk(G) of G is the minimum cardinality of a Smarandachely dominating k -set of G. S is called weak domination set if deg(u) ≤ deg(v) for every pair of (u, v) ∈ V (G)− S . The minimum cardinality of a weak domination set S is called weak domination number and denoted by γw(G) . In this paper we introduce the weak reinforcement number which is the minimum number of added edges to reduce the weak dominating number. We give some boundary of this new parameter and trees. Furthermore, some boundary of strong reinforcement number has been given for a given graph G and its complemented graph G.
منابع مشابه
Fuzzy Number-Valued Fuzzy Graph
Graph theory has an important role in the area of applications of networks and clustering. In the case of dealing with uncertain data, we must utilize ambiguous data such as fuzzy value, fuzzy interval value or values of fuzzy number. In this study, values of fuzzy number were used. Initially, we utilized the fuzzy number value fuzzy relation and then proposed fuzzy number-value f...
متن کاملWeak signed Roman k-domination in graphs
Let $kge 1$ be an integer, and let $G$ be a finite and simple graph with vertex set $V(G)$.A weak signed Roman $k$-dominating function (WSRkDF) on a graph $G$ is a function$f:V(G)rightarrow{-1,1,2}$ satisfying the conditions that $sum_{xin N[v]}f(x)ge k$ for eachvertex $vin V(G)$, where $N[v]$ is the closed neighborhood of $v$. The weight of a WSRkDF $f$ is$w(f)=sum_{vin V(G)}f(v)$. The weak si...
متن کاملWeak signed Roman domination in graphs
A {em weak signed Roman dominating function} (WSRDF) of a graph $G$ with vertex set $V(G)$ is defined as afunction $f:V(G)rightarrow{-1,1,2}$ having the property that $sum_{xin N[v]}f(x)ge 1$ for each $vin V(G)$, where $N[v]$ is theclosed neighborhood of $v$. The weight of a WSRDF is the sum of its function values over all vertices.The weak signed Roman domination number of $G...
متن کاملCoverings, matchings and paired domination in fuzzy graphs using strong arcs
The concepts of covering and matching in fuzzy graphs using strong arcs are introduced and obtained the relationship between them analogous to Gallai’s results in graphs. The notion of paired domination in fuzzy graphs using strong arcs is also studied. The strong paired domination number γspr of complete fuzzy graph and complete bipartite fuzzy graph is determined and obtained bounds for the s...
متن کاملON DEGREES OF END NODES AND CUT NODES IN FUZZY GRAPHS
The notion of strong arcs in a fuzzy graph was introduced byBhutani and Rosenfeld in [1] and fuzzy end nodes in the subsequent paper[2] using the concept of strong arcs. In Mordeson and Yao [7], the notion of“degrees” for concepts fuzzified from graph theory were defined and studied.In this note, we discuss degrees for fuzzy end nodes and study further someproperties of fuzzy end nodes and fuzz...
متن کامل